New evidence about the profitability of small and large stocks and the role of volume obtained using Strongly Typed Genetic Programming
نویسندگان
چکیده
We employ a special adaptive form of the Strongly Typed Genetic Programming (STGP)-based learning algorithm to develop trading rules based on a survival of the fittest principle. Employing returns data for the Russell 1000, Russell 2000 and Russell 3000 indices the STGP method produces greater returns compared to random walk benchmark forecasts, and the forecasting models are statistically significant in respect of their predictive effectiveness for all three indices both inand out-of-sample. Using one-step-ahead STGP models to investigate the differences in return patterns between small and large stocks we demonstrate the superiority of models developed for small-cap stocks over those developed for large-cap stocks, indicating that small stocks are more predictable. We also investigate the relationship between trading volume and returns, and find that trading volume has negligible predictive strength, implying it is not advantageous to develop volume-based trading strategies. ã 2014 Elsevier B.V. All rights reserved.
منابع مشابه
A Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers
The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...
متن کاملA Mathematical Modeling for Plastic Analysis of Planar Frames by Linear Programming and Genetic Algorithm
In this paper, a mathematical modeling is developed for plastic analysis of planar frames. To this end, the researcher tried to design an optimization model in linear format in order to solve large scale samples. The computational result of CPU time requirement is shown for different samples to prove efficiency of this method for large scale models. The fundamental concept of this model is ob...
متن کاملFrequency domain analysis of transient flow in pipelines; application of the genetic programming to reduce the linearization errors
The transient flow analyzing by the frequency domain method (FDM) is computationally much faster than the method of characteristic (MOC) in the time domain. FDM needs no discretization in time and space, but requires the linearization of governing equations and boundary conditions. Hence, the FDM is only valid for small perturbations in which the system’s hydraulics is almost linear. In this st...
متن کاملUsing Genetic Algorithm in Solving Stochastic Programming for Multi-Objective Portfolio Selection in Tehran Stock Exchange
Investor decision making has always been affected by two factors: risk and returns. Considering risk, the investor expects an acceptable return on the investment decision horizon. Accordingly, defining goals and constraints for each investor can have unique prioritization. This paper develops several approaches to multi criteria portfolio optimization. The maximization of stock returns, the pow...
متن کاملThree Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing
This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...
متن کامل